Five-Card AND Computations in Committed Format Using Only Uniform Cyclic Shuffles

نویسندگان

چکیده

Abstract In card-based cryptography, designing AND protocols in committed format is a major research topic. The state-of-the-art protocol proposed by Koch, Walzer, and Härtel ASIACRYPT 2015 uses only four cards, which the minimum permissible number. minimality of their relies on somewhat complicated shuffles having non-uniform probabilities possible outcomes. Restricting allowed to uniform closed ones entails that, best our knowledge, six cards are sufficient: six-card Mizuki Sone 2009 utilizes random bisection cut, cyclic (and hence, closed) shuffle. Thus, question has arisen: “Can we improve upon this using shuffles?” other words, existence or otherwise five-card been one most important open questions field. paper, answer affirmatively committed-format shuffles. that use cut both can be easily implemented humans.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Card-based protocols using unequal division shuffles

Card-based cryptographic protocols can perform secure computation of Boolean functions. In 2013, Cheung et al. presented a protocol that securely produces a hidden AND value using five cards; however, it fails with a probability of 1/2. The protocol uses an unconventional shuffle operation called an unequal division shuffle; after a sequence of five cards is divided into a two-card portion and ...

متن کامل

Five-Card Secure Computations Using Unequal Division Shuffle

Card-based cryptographic protocols can perform secure computation of Boolean functions. Cheung et al. recently presented an elegant protocol that securely produces a hidden AND value using five cards; however, it fails with a probability of 1/2. The protocol uses an unconventional shuffle operation called unequal division shuffle; after a sequence of five cards is divided into a two-card portio...

متن کامل

No-feedback Card Guessing for Dovetail Shuffles

We consider the following problem. A deck of 2n cards labeled consecutively from 1 on top to 2n on bottom is face down on the table. The deck is given k dovetail shuues and placed back on the table, face down. A guesser tries to guess at the cards one at a time, starting from top. The identity of the card guessed at is not revealed, nor is the guesser told whether a particular guess was correct...

متن کامل

Shuffles and Synchronized Shuffles: A Survey

We present an overview of different approaches to define shuffles and synchronized shuffles of words. The shuffle operations considered are distinguished by conditions according to which certain occurrences of symbols common to the original words may or must be identified (synchronized). The words that are shuffled may be infinite which leads to the possibility of unfair shuffling. In addition ...

متن کامل

Computations of Uniform Recurrence Equations Using Minimal Memory Size

We consider a system of uniform recurrence equations (URE) of dimension one. We show how its computation can be carried out using minimal memory size with several synchronous processors. This result is then applied to register minimization for digital circuits and parallel computation of task graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: New Generation Computing

سال: 2021

ISSN: ['0288-3635', '1882-7055']

DOI: https://doi.org/10.1007/s00354-020-00110-2